Partitions in finite geometry and related constant composition codes

Equidistant frequency permutation arrays and related constant composition codes

This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = mλ, distance d and size v is defined to be a v×n array T such that 1) each row is a multipermutation on a multiset of m symbols, each repeated with frequency λ, and 2) the Hamming distance between any two distinct rows of T is precisely d. Such an array generalizes the well-s...

Constant composition codes derived from linear codes

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Optimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$

Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...

On Shortened Finite Geometry Codes

The class of finite geometry codes [Rudolph (1964, 1967), Weldon (1967, 1968), Goethals and Delsarte (1968), Peterson and Weldon (1972)] consisting of Euclidean geometry codes and projective geometry codes forms a class of multiple-error-correcting codes that are majority-logic decodable. Being majority-logic decodable codes, finite geometry codes can be simply implemented with high speed. The ...

Finite geometry designs, codes, and Hamada's conjecture